Lamps: A Test Problem for Cooperative Coevolution
نویسندگان
چکیده
We present an analysis of the behaviour of Cooperative Co-evolution algorithms (CCEAs) on a simple test problem, that is the optimal placement of a set of lamps in a square room, for various problems sizes. Cooperative Co-evolution makes it possible to exploit more efficiently the artificial Darwinism scheme, as soon as it is possible to turn the optimisation problem into a co-evolution of interdependent sub-parts of the searched solution. We show here how two cooperative strategies, Group Evolution (GE) and Parisian Evolution (PE) can be built for the lamps problem. An experimental analysis then compares a classical evolution to GE and PE, and analyses their behaviour with respect to scale.1
منابع مشابه
A benchmark for cooperative coevolution
Cooperative co-evolution algorithms (CCEA) are a thriving sub-field of evolutionary computation. This class of algorithms makes it possible to exploit more efficiently the artificial Darwinist scheme, as soon as an optimisation problem can be turned into a co-evolution of interdependent sub-parts of the searched solution. Testing the efficiency of new CCEA concepts, however, it is not straightf...
متن کاملAdaptive Problem Decomposition in Cooperative Coevolution of Elman Recurrent Networks for Time Series Prediction
Cooperative coevolution employs different problem decomposition methods to decompose the neural network training problem into subcomponents. The efficiency of a problem decomposition method is dependent on the neural network architecture and the nature of the training problem. The adaptation of problem decomposition methods has been recently proposed which showed that different problem decompos...
متن کاملMulti-Island Competitive Cooperative Coevolution for Real Parameter Global Optimization
Problem decomposition is an important attribute of cooperative coevolution that depends on the nature of the problems in terms of separability which is defined by the level of interaction amongst decision variables. Recent work in cooperative coevolution featured competition and collaboration of problem decomposition methods that was implemented as islands in a method known as competitive islan...
متن کاملCompetitive Island-Based Cooperative Coevolution for Efficient Optimization of Large-Scale Fully-Separable Continuous Functions
In this paper, we investigate the performance of introducing competition in cooperative coevolutionary algorithms to solve large-scale fully-separable continuous optimization problems. It may seem that solving large-scale fully-separable functions is trivial by means of problem decomposition. In principle, due to lack of variable interaction in fullyseparable problems, any decomposition is viab...
متن کاملAlgorithms for Test-Based Problems
Problems in which some elementary entities interact with each other are common in computational intelligence. This scenario, typical for coevolving artificial-life agents, learning strategies for games, and machine learning from examples, can be formalized as a test-based problem and conveniently embedded in the common conceptual framework of coevolution. In test-based problems candidate soluti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011